Approximating power by weights
نویسنده
چکیده
Determining the power distribution of the members of a shareholder meeting or a legislative committee is a well-known problem for many applications. In some cases it turns out that power is nearly proportional to relative voting weights, which is very beneficial for both theoretical considerations and practical computations with many members. We present quantitative approximation results with precise error bounds for several power indices as well as impossibility results for such approximations between power and weights.
منابع مشابه
Modified Goal Programming Approach for Improving the Discrimination Power and Weights Dispersion
Data envelopment analysis (DEA) is a technique based on linear programming (LP) to measure the relative efficiency of homogeneous units by considering inputs and outputs. The lack of discrimination among efficient decision making units (DMUs) and unrealistic input-outputs weights have been known as the drawback of DEA. In this paper the new scheme based on a goal programming data envelopment an...
متن کاملIncreasing the discrimination power the decision making units based on reducing dispersion of weights in the data envelopment analysis
Data envelopment analysis which is a nonparametric technique for evaluating relative efficiency of the decision making units with multiple inputs and outputs, has been a very popular method among researchers. While this nonparametric technique is popular, it has some drawbacks such as lack of discrimination in efficient units and weights dispersion .The present study, which is a model based on ...
متن کاملTractability of Approximating Multivariate Linear Functionals
We review selected tractability results for approximating linear tensor product functionals defined over reproducing kernel Hilbert spaces. This review is based on Volume II of our book [5] Tractability of Multivariate Problems. In particular, we show that all non-trivial linear tensor product functionals defined over a standard tensor product unweighted Sobolev space suffer the curse of dimens...
متن کاملDeep Radial Kernel Networks: Approximating Radially Symmetric Functions with Deep Networks
We prove that a particular deep network architecture is more efficient at approximating radially symmetric functions than the best known 2 or 3 layer networks. We use this architecture to approximate Gaussian kernel SVMs, and subsequently improve upon them with further training. The architecture and initial weights of the Deep Radial Kernel Network are completely specified by the SVM and theref...
متن کاملTowards Accurate Binary Convolutional Neural Network
We introduce a novel scheme to train binary convolutional neural networks (CNNs) – CNNs with weights and activations constrained to {-1,+1} at run-time. It has been known that using binary weights and activations drastically reduce memory size and accesses, and can replace arithmetic operations with more efficient bitwise operations, leading to much faster test-time inference and lower power co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1802.00497 شماره
صفحات -
تاریخ انتشار 2018